Splitting balanced incomplete block designs
نویسنده
چکیده
منابع مشابه
On the Type-1 Optimality of Nearly Balanced Incomplete Block Designs with Small Concurrence Range
The class of nearly balanced incomplete block designs with concurrence range l, or NBBD(l), is defined. This extends previous notions of “most balanced” designs to cover settings where off-diagonal entries of the concurrence matrix must differ by a positive integer l ≥ 2. Sufficient conditions are found for optimality of NBBD(2)’s under type-1 criteria, then used to establish Aand D-optimality ...
متن کاملBalanced nested designs and balanced arrays
Balanced nested designs are closely related to other combinatorial structures such as balanced arrays and balanced n-ary designs. In particular, the existence of symmetric balanced nested designs is equivalent to the existence of some balanced arrays. In this paper, various constructions for symmetric balanced nested designs are provided. They are used to determine the spectrum of symmetric bal...
متن کاملVariance Balanced Block Designs with Repeated Blocks
Some construction methods of the variance balanced block designs with repeated blocks are given. They are based on the incidence matrices of the balanced incomplete block designs with repeated blocks.
متن کاملRobustness of Nested Balanced Incomplete Block Designs Against Missing Data
Robustness aspects of nested balanced incomplete block designs against missing data have been investigated using connectedness and efficiency criteria. Sufficient condition for robustness of a design has been obtained for the loss of any m observations, using connectedness criterion. Designs robust against the loss of any m observations belonging to one sub-block, loss of any two observations b...
متن کاملNew Box-Behnken designs
Box and Behnken (1960) constructed 10 three-level, second-order designs, while their 1958 technical report contained seven additional designs. This series of designs is based on combining 2 or 2 designs in different subsets of the t factors, with k < t. The subsets of size k were determined using balanced (or partially balanced) incomplete block designs. This present article offers additional B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 31 شماره
صفحات -
تاریخ انتشار 2005